Improving Optimal Winner Determination Algorithms Using Graph Structures
نویسنده
چکیده
This paper presents an extended algorithm for the optimal winner determination problem in combinatorial auctions. This algorithm is essentially based on new graphs of shared and unshared items which enable an oriented exploration of the bids and thus accelerate the search for the optimal solution. The higher the number of bids, the more efficient the graphs. First of all, using an example, the steps of the search algorithm are given and the use of the graphs is illustrated. This is followed by a presentation of the algorithms for partitioning the bids, those for building the graphs and finally those used for exploring the graphs while building the optimal solution tree. This article therefore shows that the different tools proposed, i.e. the graphs and the properties defined for them, are generic and can be plugged to any current algorithms in order to improve their search processes. Finally, the results of the experimental evaluation of our algorithms are given.
منابع مشابه
Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملOPTIMALIZATION PHASE USING GRAPH MODELLING FOR RELIABLE BUILDING COMPLEXES
During the planning phase of modern, complex, block-structured, large-area located, but still landscape-harmonized health-care buildings, the key is the optimal positioning of the blocks and functions, simultaneously ensuring the most-effective backup-paths for any transportation route failure in the buildings in order to speed up system operation, reduce maintenance costs and especially to imp...
متن کاملImproved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper presents a more sophisticated search algorithm for optimal (and anytime) winner determination, including...
متن کامل